High-performance BWT-based Encoders
نویسنده
چکیده
In 1994, Burrows and Wheeler [5] developed a data compression algorithm which performs significantly better than Lempel-Ziv based algorithms. Since then, a lot of work has been done in order to improve their algorithm, which is based on a reversible transformation of the input string, called BWT (the Burrows-Wheeler transformation). In this paper, we propose a compression scheme based on BWT, MTF (move-to-front coding), and a version of the algorithms presented in [13].
منابع مشابه
Robust Distributed Source Coding with Arbitrary Number of Encoders and Practical Code Design Technique
The robustness property can be added to DSC system at the expense of reducing performance, i.e., increasing the sum-rate. The aim of designing robust DSC schemes is to trade off between system robustness and compression efficiency. In this paper, after deriving an inner bound on the rate–distortion region for the quadratic Gaussian MDC based RDSC system with two encoders, the structure of...
متن کاملUniversal Lossless Source Coding with the Burrows Wheeler Transform
The Burrows Wheeler Transform (BWT) is a reversible sequence transformation used in a variety of practical lossless source-coding algorithms. In each, the BWT is followed by a lossless source code that attempts to exploit the natural ordering of the BWT coefficients. BWT-based compression schemes are widely touted as low-complexity algorithms giving lossless coding rates better than those of th...
متن کاملHigh-rate systematic recursive convolutional encoders: minimal trellis and code search
We consider high-rate systematic recursive convolutional encoders to be adopted as constituent encoders in turbo schemes. Douillard and Berrou showed that, despite its complexity, the construction of high-rate turbo codes by means of high-rate constituent encoders is advantageous over the construction based on puncturing rate-1/2 constituent encoders. To reduce the decoding complexity of high-r...
متن کاملError-Resilient Block Sorting
“Blocksorting Transform” (BWT) is a lossless compression technique that has become increasingly popular in recent years due to the fact that it achieves high performance compression (almost as good as in PPM, with fast speed (not much slower than gZip). It is perhaps the first lossless compression algorithm to combine these two properties. BWT breaks its input into large blocks, and performs an...
متن کاملSome Thoughts on the Equivalence of Systematic and Non-Systematic Convolutional Encoders∗
In this paper, we re-examine the notion of equivalent systematic and non-systematic convolutional encoders within the context of turbo coding. In particular, we argue that using equivalent systematic and non-systematic constituent encoders in a parallel concatenated system does not yield the same performance. In fact, the performance can differ greatly, depending on the effective free distance ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/cs/0508086 شماره
صفحات -
تاریخ انتشار 2005